Towards a Doubly Efficient IP=PSPACE

We show that every language in PSPACE decidable by a Turing machine in time T(n)=n^{O(\log n)} admits a doubly efficient interactive proof system: the prover runs in time polynomial in T(n), and the verifier runs in time polynomial in n. This extends the best previously known regime for such proof…